A Horizontal Rainbow

A Rainbow Inverse Problem

We consider the radiative transfer equation (RTE) with reflection in a three-dimensional domain, infinite in two dimensions, and prove an existence result. Then, we study the inverse problem of retrieving the optical parameters from boundary measurements, with help of existing results by Choulli and Stefanov. This theoretical analysis is the framework of an attempt to model the color of the ski...

Rainbow Matchings and Rainbow Connectedness

Aharoni and Berger conjectured that every collection of n matchings of size n+1 in a bipartite graph contains a rainbow matching of size n. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture. The conjecture is known to hold when the matchings are m...

Rainbow.

Rainbow edge-coloring and rainbow domination

Let G be an edge-colored graph with n vertices. A rainbow subgraph is a subgraph whose edges have distinct colors. The rainbow edge-chromatic number of G, written χ̂′(G), is the minimum number of rainbow matchings needed to cover E(G). An edgecolored graph is t-tolerant if it contains no monochromatic star with t+1 edges. If G is t-tolerant, then χ̂′(G) < t(t+ 1)n lnn, and examples exist with χ̂′(...

horizontal root fracture

چکیده ندارد.